20BJ: a metalogical framework theorem prover based on equational logic

ثبت نشده
چکیده

This paper describes 20BJ, a tactic-based generic theorem prover that encodes object logics into equational logic via an abstract data type of object logic sentences and proofs. 20BJ is built upon OBJ3, a term rewriting implementation of (order sorted conditional) equational logic. Because object logic proofs are explicitly represented, 20BJ can not only reason with them, but also about them, as in arguments by symmetry and other metalogical devices of ordinary mathematics; this motivates the ‘m eta’ of ‘metalogicah in the title. First-order equational logic has advantages in simplicity and efficiency over more complex framework logics, such as intuitionistic higher-order type theory, and also facilitates the definition of tactic languages. In addition, 20B J benefits from 0 B J3 ’s powerful parametrized module system, and it has a convenient X window user interface. The paper concludes with a sketch of some semantic foundations based upon ruled parchments, charters, and institutions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parameterized Metareasoning in Membership Equational Logic

Basin, Clavel, and Meseguer showed in [1] that membership equational logic is a good metalogical framework because of its initial models and support of reflective reasoning. A development and an application of those ideas was presented later in [4]. Here we further extend the metalogical reasoning principles proposed there to consider classes of parameterized theories and apply this reflective ...

متن کامل

UTP2: Higher-Order Equational Reasoning by Pointing

We describe a prototype theorem prover, U·(TP)2, developed to match the style of hand-written proof work in the Unifying Theories of Programming semantical framework. This is based on alphabetised predicates in a 2nd-order logic, with a strong emphasis on equational reasoning. We present here an overview of the user-interface of this prover, which was developed from the outset using a pointand-...

متن کامل

Axiomatizing Re ective Logics and Languages

The very success and breadth of re ective techniques underscores the need for a general theory of re ection. At present what we have is a wide-ranging variety of re ective systems, each explained in its own idiosyncratic terms. Metalogical foundations can allow us to capture the essential aspects of re ective systems in a formalismindependent way. This paper proposes metalogical axioms for re e...

متن کامل

Preface: In memory of Wim Blok

algebraic logic: Full models, Frege systems, and metalogical properties he formulates an institutional analogue of the property of congruence and analyses how it helps in the preservation of other metalogical properties such as conjunction, disjunction, the deduction-detachment theorem, and two versions of reductio ad absurdum. In partial contrast, Raftery’s paper The equational definability of...

متن کامل

An Application of Automated Equational Reasoning to Many-valued Logic

In this paper we present the theorem prover SBR3 for equational logic and its application in the many-valued logic of Lukasiewicz. We give a new equational axiomatization of many-valued logic and we prove by SBR3 that it is equivalent to the classical equational presentation of such logic given by Wajsberg. We feel that our equational axiomatization of Wajsberg algebras is more suited for autom...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017